3d Mesh Refinement Procedure Using the Bisection and Rivara Algorithms with Mesh Quality Assessment
نویسندگان
چکیده
Mesh refinement procedures for the solution of three dimensional problems are described. The computational domain is represented by an assembly of tetrahedral elements and the mesh refinement is acheived by the bisection and Rivara methods using an explicit mesh density function coupled with an automatic 3D mesh generator. A couple of benchmark examples is used to compare the performance of both refinement methods in terms of mesh and size qualities, number of generated elements and CPU time consumed.
منابع مشابه
Multithread Lepp-Bisection Algorithm for Tetrahedral Meshes
Longest edge refinement algorithms were designed to deal with the iterative and local refinement of triangulations for finite element applications. In 3-dimensions the algorithm locally refines a tetredra set Sref and some neighboring tetraedra in each iteration. The new points introduced in the mesh are midpoints of the longest edge of some tetrahedra of either of the input mesh or of some ref...
متن کاملA Study on Size-Optimal Longest Edge Refinement Algorithms
Mesh generation and refinement are widely used in applications that require a decomposition of geometric objects for processing. Longest edge refinement algorithms seek to obtain a better decomposition over selected regions of the mesh by the division of its elements. Until now, these algorithms did not provide theoretical guarantees on the size of the triangulation obtained. In this paper we p...
متن کاملMesh Refinement Based on the 8-Tetrahedra Longest- Edge Partition
The 8-tetrahedra longest-edge (8T-LE) partition of any tetrahedron is defined in terms of three consecutive edge bisections, the first one performed by the longest-edge. The associated local refinement algorithm can be described in terms of the polyhedron skeleton concept using either a set of precomputed partition patterns or by a simple edgemidpoint tetrahedron bisection procedure. An effecti...
متن کاملLongest-edge algorithms for size-optimal refinement of triangulations
Longest-edge refinement algorithms were designed to iteratively refine the mesh for finite-element applications by maintaining mesh quality (assuring a bound on the smallest angle). In this paper we improve geometrical results on longest-edge refinement algorithms and provide precise bounds on the refinement propagation. We prove that the iterative application of the algorithm gradually reduces...
متن کاملLocal Refinement of Quadrilateral Meshes
Subelement patterns using bisection of edges and schemes for selecting edges to be split are described for the local refinement of elements in all-quadrilateral and quadrilateral-dominant planar meshes. Subelement patterns using trisection of edges are also described for the local refinement of elements in all-quadrilateral planar meshes. These patterns and schemes are easily extendible to quad...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004